Function Approximation by Polynomial Wavelets Generated

نویسندگان

  • J. Fernando Marar
  • E. C. B. Carvalho Filho
  • G. C. Vasconcelos
چکیده

Wavelet functions have been successfully used in many problems as the activation function of feedforward neural networks ZB92],,STK92], PK93]. In this paper, a family of polynomial wavelets generated from powers of sigmoids is described which provides a robust way for designing neural network architectures. It is shown, through experimentation, that function members of this family can present a very good adaptation capability which make them attractive for applications of function approximation. In the experiments carried out, it is observed that only a small number of daughter wavelets is usually necessary to provide good approximation characteristics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Approximation Error for Quasi-Interpolators and (Multi-)Wavelet Expansions

We investigate the approximation properties of general polynomial preserving operators that approximate a function into some scaled subspace of L via an appropriate sequence of inner products. In particular, we consider integer shift-invariant approximations such as those provided by splines and wavelets, as well as finite elements and multi-wavelets which use multiple generators. We estimate t...

متن کامل

On Computation of Battle{Lemari e's Wavelets

We propose a matrix approach to the computation of Battle-Lemari e's wavelets. Since the Fourier transform of the scaling function is the product of the inverse F(x) of a square root of a positive trigonometric polynomial and the Fourier transform of a b-spline of order m. The polynomial is the symbol of an bi-innnite matrix B associated with b-spline of order 2m. We approximate B 2m by its nit...

متن کامل

Comparison between Beta Wavelets Neural Networks , RBF Neural Networks and Polynomial Approximation for 1 D , 2 D Functions Approximation

This paper proposes a comparison between wavelet neural networks (WNN), RBF neural network and polynomial approximation in term of 1-D and 2-D functions approximation. We present a novel wavelet neural network, based on Beta wavelets, for 1-D and 2-D functions approximation. Our purpose is to approximate an unknown function f: Rn R from scattered samples (xi; y = f(xi)) i=1....n, where first, w...

متن کامل

Ridge wavelets on the ball

We present a ridge polynomial wavelet-type system on the unit ball in R such that any continuous function can be expanded with respect to these wavelets. The order of the growth of the degrees of polynomials is optimal. Coefficient functionals are the inner products of the function and the corresponding elements of a ”dual wavelet system”. The ”dual wavelets” is also a ridge polynomial system w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996